Interference-free polyhedral configurations for stacking

نویسندگان

  • Venkateswara R. Ayyadevara
  • David A. Bourne
  • Kenji Shimada
  • Robert H. Sturges
چکیده

This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference analysis module of a stacking planner developed by us. Parts in a stack should not interfere with each other and should also satisfy stability, grasping, and stacking plan feasibility related constraints. We present two techniques to speed up the expensive step of -space obstacle computation. The first technique identifies orientation intervals (for a convex pair of solids) within which the topology of face-edge-vertex graph of an obstacle stays the same. Within this interval, -space obstacle geometry for one orientation can be extrapolated from obstacle geometry for another orientation. Our experiments show that extrapolation takes an order of magnitude less than the time taken to compute an obstacle from scratch. The second technique computes near optimal interference-free positions for a discrete orientation without having to compute the complete -space obstacle. Our experiments show that, for complex sheet metal parts, less than 0.1% of the convex component pairs are evaluated in order to compute an interference-free configuration. We describe a configuration space-based method to compute a list of interference-free configurations that can be tested to see if they satisfy the above mentioned constraints. The cost function is a weighted sum of components that penalize floor space utilization and height of center of gravity of parts. The algorithm is able to pick nested stacks that tend to be stable and compact without having to explicitly enumerate features that can be nested. It is also able to accommodate flanges in holes to reduce the value of the user specified cost function. We use three test parts to illustrate the effect of the two techniques to speed up -space obstacle computation. We also show the stacking plans generated for three different values of the weighting parameter in the cost function used by the stacking planner.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Electric field control of soliton motion and stacking in trilayer graphene.

The crystal structure of a material plays an important role in determining its electronic properties. Changing from one crystal structure to another involves a phase transition that is usually controlled by a state variable such as temperature or pressure. In the case of trilayer graphene, there are two common stacking configurations (Bernal and rhombohedral) that exhibit very different electro...

متن کامل

Dynamic Exploration of Value Configurations: Polyhedral animation of conventional value frameworks (2008)

Images of animation to be presented to a Panel on Ethics and Policies for Sustainable Futures on the occasion of the General Assembly of the World Academy of Art and Science (Hyderabad; October 2008) as argued in a background paper for that panel (Topology of Valuing: dynamics of collective engagement with polyhedral value configurations, 2008). Complementary animation accessible from Dynamic E...

متن کامل

Cure Kinetic of Polyurethane/Fluorinated POSS Hybrid

One of the decisive factors in obtaining the desired properties in coatings is their complete curing, which necessitates the study of kinetics of curing. In recent years, many studies have been conducted on the use of polyhedral oligomeric silsesquioxane (POSS) in coatings. Creating functional groups on POSS and using it in formulation can create new or improve the properties of coatings. I...

متن کامل

A Hierarchy of Polyhedral Arrangements

iii Acknowledgments iv Chapter 1. A Hierarchy of Polyhedral Arrangements 1 1.1. Polyhedral Arrangements 1 1.2. Polyhedral Dissections 1 1.3. Polyhedral Complexes 5 1.4. Polyhedral Triangulations 8 1.5. A Hierarchy of Polyhedral Arrangements 9 Chapter 2. Computation on Polyhedral Arrangements 12 2.1. Bucket Method 12 2.2. Sage Code 13 2.3. Experiments 16 Chapter 3. Regular Triangulations 22 3.1....

متن کامل

Beneets of Applicability Constraints in Decomposition-free Interference Detection between Nonconvex Polyhedral Models

Nonconvex polyhedral models of workpieces or robot parts can be directly tested for interference without resorting to a previous decomposition into convex entities Here we show that this in terference detection based on the elemental edge face intersection test can be performed e ciently a strategy based on applicability constraints re duces drastically the set of edge face pairings that have t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Robotics and Automation

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2002